Cluster-level Logging of Containers with Containers
نویسندگان
چکیده
منابع مشابه
From Low-Level Pointers to High-Level Containers
We propose a method that transforms a C program manipulating containers using low-level pointer statements into an equivalent program where the containers are manipulated via calls of standard high-level container operations like push back or pop front. The input of our method is a C program annotated by a special form of shape invariants which can be obtained from current automatic shape analy...
متن کاملCategories of containers
We introduce the notion of containers as a mathematical formalisation of the idea that many important datatypes consist of templates where data is stored. We show that containers have good closure properties under a variety of constructions including the formation of initial algebras and final coalgebras. We also show that containers include strictly positive types and shapely types but that th...
متن کاملDerivatives of Containers
We are investigating McBride’s idea that the type of one-hole contexts are the formal derivative of a functor from a categorical perspective. Exploiting our recent work on containers we are able to characterise derivatives by a universal property and show that the laws of calculus including a rule for initial algebras as presented by McBride hold — hence the differentiable containers include th...
متن کاملShifter: Containers for HPC
Container-based computed is rapidly changing the way software is developed, tested, and deployed. This paper builds on previously presented work on a prototype framework for running containers on HPC platforms. We will present a detailed overview of the design and implementation of Shifter, which in partnership with Cray has extended on the early prototype concepts and is now in production at N...
متن کاملDynamic Shortest Paths Containers
Using a set of geometric containers to speed up shortest path queries in a weighted graph has been proven a useful tool for dealing with large sparse graphs. Given a layout of a graph G = (V, E), we store, for each edge (u, v) ∈ E, the bounding box of all nodes t ∈ V for which a shortest u-t-path starts with (u, v). Shortest path queries can then be answered by Dijkstra’s algorithm restricted t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queue
سال: 2016
ISSN: 1542-7730,1542-7749
DOI: 10.1145/2956641.2965647